Infinite Codes for Memoryless Channels
نویسندگان
چکیده
منابع مشابه
Adaptive Viterbi decoding of convolutional codes over memoryless channels
In this paper, an adaptive decoding algorithm for convolutional codes, which is a modification of the Viterbi algorithm (VA) is presented. For a given code, the proposed algorithm yields nearly the same error performance as the VA while requiring a substantially smaller average number of computations. Unlike most of the other suboptimum algorithms, this algorithm is self-synchronizing. If the t...
متن کاملOn Universal Ldpc Codes over Memoryless Symmetric Channels
A design of robust error-correcting codes that achieve reliable communication over various channels is of great theoretical and practical interest. Such codes are termed universal. This paper considers the universality of lowdensity parity-check (LDPC) code ensembles over families of memoryless binary-input output-symmetric (MBIOS) channels. Universality is considered both under belief-propagat...
متن کاملOn the Symmetry of Polar Codes for Symmetric Binary-Input Discrete Memoryless Channels
In this paper, we study the symmetry of polar codes on symmetric binary-input discrete memoryless channels (B-DMC). The symmetry property of polar codes is originally pointed out in Arikan’s work for general B-DMC channels. With the symmetry, the output vector y 1 (N be the block length) can be divided into equivalence classes in terms of their transition probabilities. In this paper, we presen...
متن کاملThe Log-Volume of Optimal Codes for Memoryless Channels, Up to a Few Nats
This paper derives a tight asymptotic upper bound on the maximum volume M∗(n, ) of length-n codes for memoryless channels subject to an average decoding error probability : M(n, ) = exp{nC − √nV Φ−1( ) + 1 2 log n + An, + o(1)} where C is Shannon capacity, V is channel dispersion, Φ is the tail probability of the normal distribution, and An, is a bounded sequence that can be explicitly identifi...
متن کاملAn Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels
This paper derives an improved sphere-packing (ISP) bound for finite-length codes whose transmission takes place over symmetric memoryless channels. We first review classical results, i.e., the 1959 sphere-packing (SP59) bound of Shannon for the Gaussian channel, and the 1967 sphere-packing (SP67) bound of Shannon et al. for discrete memoryless channels. A recent improvement on the SP67 bound, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1959
ISSN: 0003-4851
DOI: 10.1214/aoms/1177706107